Genericity and the pi-Calculus
نویسندگان
چکیده
منابع مشابه
Proving the Genericity Lemma by Leftmost Reduction is Simple
Abst rac t . The Genericity Lemma is one of the most important motivations to take in the untyped lambda calculus the notion of solvability as a formal representation of the informal notion of undefinedness. We generalise solvability towards typed lambda calculi, and we call this generalisation: usability. We then prove the Genericity Lemma for un-usable terms. The technique of the proof is bas...
متن کاملDesign and formal verification of DZMBE+
In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...
متن کاملThe genericity theorem and parametricity in the polymorphic A-calculus
Longo, G., K. M&ted and S. Soloviev, The genericity theorem and parametricity in the polymorphic I-calculus, Theoretical Computer Science 121 (1993) 323-349. This paper focuses on how terms of the polymorphic I-calculus, which may take types as inputs, depend on types. These terms are generally understood, in all models, to have an “essentially” constant meaning on input types. We show how the ...
متن کاملGenericity of Nondegenerate Critical Points and Morse Geodesic Functionals
We consider a family of variational problems on a Hilbert manifold parameterized by an open subset of a Banach manifold, and we discuss the genericity of the nondegeneracy condition for the critical points. Based on an idea of B. White [24], we prove an abstract genericity result that employs the infinite dimensional Sard–Smale theorem. Applications are given by proving the genericity of metric...
متن کاملA New-type Pi Calculus with Buffers and Its Bisimulation
According to the features of asynchronous interaction in systems, a new-type Pi calculus with buffers — Buffer-Pi calculus is proposed, the new labelled transition system based on buffers is introduced, the enhanced describing capability is shown to apply Buffer-Pi calculus to modeling with the concrete example of asynchronous interaction, and the new behavior equivalence relations are defined,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003